Optimization and its Application

The quantum particle swarm optimization (QPSO) algorithm exists some defects, such as premature convergence, poor search ability and easy falling into local optimal solutions. The adaptive adjustment strategy of inertia weight, chaotic search method and neighborhood mutation strategy are introduced into the QPSO algorithm in order to propose an improved quantum particle swarm optimization (AMCQPSO) algorithm in this paper. In the AMCQPSO algorithm, the chaotic search method is employed to promote the quality of initial population. The adaptive adjustment strategy of inertia weight is used to adjust the global search ability and local search ability of particles in the running process of QPSO algorithm. The neighborhood mutation strategy is used to increase the diversity of population and avoid premature convergence. Finally, in order to evaluate the performance of the AMCQPSO algorithm, several well-known benchmark functions are selected in this paper. The experiment simulations show that the proposed AMCQPSO algorithm can effectively improve the quality of solutions, and takes on powerful optimizing ability and more quickly convergence speed.